Robustness of a Tree-like Network of Interdependent Networks

نویسندگان

  • Jianxi Gao
  • Sergey V. Buldyrev
  • Shlomo Havlin
  • H. Eugene Stanley
چکیده

In reality, many real-world networks interact with and depend on other networks. We develop an analytical framework for studying interacting networks and present an exact percolation law for a network of n interdependent networks (NON). We present a general framework to study the dynamics of the cascading failures process at each step caused by an initial failure occurring in the NON system. We study and compare both n coupled Erd˝ os-Rényi (ER) graphs and n coupled random regular (RR) graphs. We found recently [Gao et. al. arXive:1010.5829] that for an NON composed of n ER networks each of average degree k, the giant component, P∞, is given by P∞ = p[1 − exp(−kP∞)] n where 1 − p is the initial fraction of removed nodes. Our general result coincides for n = 1 with the known Erd˝ os-Rényi second-order phase transition at a threshold, p = pc, for a single network. For n = 2 the general result for P∞ corresponds to the n = 2 result [Buldyrev et. al., Nature , 464, (2010)]. Here we show for an NON composed of n coupled RR networks each of degree k, that the giant components is given by P∞ = p 1 − {p 1/n P (n−1)/n ∞ [(1 − (P∞/p) 1/n) (k−1)/k − 1] + 1} k n. Similar to the ER NON, for n = 1 the percolation transition at pc, is of second order while for any n > 1 it is of first order. The first order percolation transition in both ER and RR (for n > 1) is accompanied by cascading failures between the networks due to their interdependencies. However, we find that the robustness of n coupled RR networks of degree k is dramatically higher compared to the n coupled ER networks of average degree k. While for ER NON there exists a critical minimum average degree k = kmin, that increases with n, below which the system collapses, there is no such analogous kmin for RR NON system. For any k > 2, the RR NON is stable, i.e., pc < 1. This is due to the critical role played by singly connected nodes which exist in ER NON and enhance the cascading failures but do not exist in the RR NON system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interdependent Security Game Design over Constrained Linear Influence Networks

In today's highly interconnected networks, security of the entities are often interdependent. This means security decisions of the agents are not only influenced by their own costs and constraints, but also are affected by their neighbors’ decisions. Game theory provides a rich set of tools to analyze such influence networks. In the game model, players try to maximize their utilities through se...

متن کامل

Assortativity Decreases the Robustness of Interdependent Networks

It was recently recognized that interdependencies among different networks can play a crucial role in triggering cascading failures and, hence, systemwide disasters. A recent model shows how pairs of interdependent networks can exhibit an abrupt percolation transition as failures accumulate. We report on the effects of topology on failure propagation for a model system consisting of two interde...

متن کامل

Robustness of network of networks under targeted attack.

The robustness of a network of networks (NON) under random attack has been studied recently [Gao et al., Phys. Rev. Lett. 107, 195701 (2011)]. Understanding how robust a NON is to targeted attacks is a major challenge when designing resilient infrastructures. We address here the question how the robustness of a NON is affected by targeted attack on high- or low-degree nodes. We introduce a targ...

متن کامل

Optimization of robustness of interdependent network controllability by redundant design

Controllability of complex networks has been a hot topic in recent years. Real networks regarded as interdependent networks are always coupled together by multiple networks. The cascading process of interdependent networks including interdependent failure and overload failure will destroy the robustness of controllability for the whole network. Therefore, the optimization of the robustness of i...

متن کامل

Robustness in Interdependent Networks MMath CD

The field of network science has seen massive growth in the last 15 years. Tools have been developed to study the properties of abstract networks, as well as problems involving real-world systems. One such problem concerns the robustness of a network: how well the network continues to function when parts of its structure are destroyed. A rapidly emerging area of network science is the study of ...

متن کامل

The Properties of Tree-Like Hierarchical Networks

Tree-like hierarchical structure is one of the key features in many real complex systems. To investigate its properties, a deterministic tree-like hierarchical network model is proposed. Next, the static properties of the tree-like hierarchical networks are discussed. The simulation and theoretical results prove that the artificial tree-like networks conformably possess small-world and scalefre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1108.5515  شماره 

صفحات  -

تاریخ انتشار 2011